Understanding Difficulty-Based Sample Weighting with a Universal Difficulty Measure

نویسندگان

چکیده

Sample weighting is widely used in deep learning. A large number of methods essentially utilize the learning difficulty training samples to calculate their weights. In this study, scheme called difficulty-based weighting. Two important issues arise when explaining scheme. First, a unified measure that can be theoretically guaranteed for does not exist. The difficulties are determined by multiple factors including noise level, imbalance degree, margin, and uncertainty. Nevertheless, existing measures only consider single factor or part, but entirety. Second, comprehensive theoretical explanation lacking with respect demonstrating why schemes effective we prove generalization error sample as universal measure. Furthermore, provide formal justifications on role learning, consequently revealing its positive influences both optimization dynamics performance models, which instructive schemes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Model-Independent Measure of Regression Difficulty

data mining, machine learning, model fitting, regression, exploratory data analysis, error rate estimation, data modeling, data cleaning, data preparation, predictability We prove an inequality bound for the variance of the error of a regression function plus its non-smoothness as quantified by the Uniform Lipschitz condition. The coefficients in the inequality are calculated based on training ...

متن کامل

Universal Psychometrics Tasks: difficulty, composition and decomposition

This note revisits the concepts of task and difficulty. The notion of cognitive task and its use for the evaluation of intelligent systems is still replete with issues. The view of tasks as MDP in the context of reinforcement learning has been especially useful for the formalisation of learning tasks. However, this alternate interaction does not accommodate well for some other tasks that are us...

متن کامل

Motif Difficulty (MD): A Predictive Measure of Problem Difficulty for Evolutionary Algorithms Using Network Motifs

One of the major challenges in the field of evolutionary algorithms (EAs) is to characterise which kinds of problems are easy and which are not. Researchers have been attracted to predict the behaviour of EAs in different domains. We introduce fitness landscape networks (FLNs) that are formed using operators satisfying specific conditions and define a new predictive measure that we call motif d...

متن کامل

Constructing a Universal Scale of High School Course Difficulty

This study examined the usefulness of applying the Rasch rating scale model (Andrich, 1978) to high school grade data. ACT Assessment test scores (English, Mathematics, Reading, and Science) were used as " common items " to adjust for different grading standards in individual high school courses both within and across schools. This scaling approach yielded an ACT Assessment-adjusted high school...

متن کامل

Understanding Searchers’ Perception of Task Difficulty: Relationships with Task Type

We report findings that help us better understand the difficulty of tasks which involve information seeking, retrieving, gathering, and use. We examined the data gathered from two interactive information retrieval user studies on how users’ perception of task difficulty changes before and after searching for information to solve tasks, and how the difficulty of tasks relates with users’ backgro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2023

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-031-26409-2_5